Pattern avoidance and the Bruhat order
نویسنده
چکیده
The structure of order ideals in the Bruhat order for the symmetric group is elucidated via permutation patterns. A method for determining nonisomorphic principal order ideals is described and applied for small lengths. The permutations with boolean principal order ideals are characterized. These form an order ideal which is a simplicial poset, and its rank generating function is computed. Moreover, the permutations whose principal order ideals have a form related to boolean posets are also completely described. It is determined when the set of permutations avoiding a particular set of patterns is an order ideal, and the rank generating functions of these ideals are computed. Finally, the Bruhat order in types B and D is studied, and the elements with boolean principal order ideals are characterized and enumerated by length.
منابع مشابه
Pattern avoidance and Boolean elements in the Bruhat order on involutions
We show that the principal order ideal of an element w in the Bruhat order on involutions in a symmetric group is a Boolean lattice if and only if w avoids the patterns 4321, 45312 and 456123. Similar criteria for signed permutations are also stated. Involutions with this property are enumerated with respect to natural statistics. In this context, a bijective correspondence with certain Motzkin...
متن کاملPattern Avoidance and the Bruhat Order on Involutions
We show that the principal order ideal below an element w in the Bruhat order on involutions in a symmetric group is a Boolean lattice if and only if w avoids the patterns 4321, 45312 and 456123. Similar criteria for signed permutations are also stated. Involutions with this property are enumerated with respect to natural statistics. In this context, a bijective correspondence with certain Motz...
متن کاملInversion arrangements and Bruhat intervals
Let W be a finite Coxeter group. For a given w ∈ W , the following assertion may or may not be satisfied: (∗) The principal Bruhat order ideal of w contains as many elements as there are regions in the inversion hyperplane arrangement of w. We present a type independent combinatorial criterion which characterises the elements w ∈ W that satisfy (∗). A couple of immediate consequences are derive...
متن کاملReduced Decompositions with One Repetition and Permutation Pattern Avoidance
In 2007, Tenner established a connection between pattern avoidance in permutations and the Bruhat order on permutations by showing that the downset of a permutation in the Bruhat order is a Boolean algebra if and only if the permutation is 3412 and 321 avoiding. Tenner mentioned, but did not prove, that if the permutation is 321 avoiding and contains exactly one 3412 pattern, or if the permutat...
متن کاملIntervals and factors in the Bruhat order
In this paper we study those generic intervals in the Bruhat order of the symmetric group that are isomorphic to the principal order ideal of a permutation w, and consider when the minimum and maximum elements of those intervals are related by a certain property of their reduced words. We show that the property does not hold when w is a decomposable permutation, and that the property always hol...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Comb. Theory, Ser. A
دوره 114 شماره
صفحات -
تاریخ انتشار 2007